Persistent party rooms

ABSTRACT

Using persistent party rooms, including: initializing, via a computing device, a global array according to a hierarchical server architecture; determining, via the computing device, whether or not to create a new persistent party room or to join a previously bookmarked persistent party room; creating, via the computing device, the new persistent party room within a position indexed in the global array; and joining, via the computing device, the previously bookmarked persistent party room by searching for the previously bookmarked party room utilizing the global array.

BACKGROUND

1. Field of the Invention

The present application relates to online gaming environments, and morespecifically, to party rooms or chat rooms used while playing games.

2. Background

Party rooms are online chat environments where gamers may voice chat,text chat, video chat, etc., while playing games or online games, duringa game or during a break in a game. One of the problems with party roomsis that they are transitory and do not persist from session to session.Currently, party rooms must be recreated anew by the user whenevereveryone leaves a room and when anyone wants to return to that partyroom or join a new one. This approach may be inefficient from anend-user point of view.

SUMMARY

Implementations of the present application provide for persistent partyrooms that are persistent and that can be bookmarked and returned.

In one implementation, provided is a method for using persistent partyrooms, including: initializing, via a computing device, a global arrayaccording to a hierarchical server architecture; determining, via thecomputing device, whether or not to create a new persistent party roomor to join a previously bookmarked persistent party room; creating, viathe computing device, the new persistent party room within a positionindexed in the global array; and joining, via the computing device, thepreviously bookmarked persistent party room by searching for thepreviously bookmarked party room utilizing the global array.

In another implementation, provided is a non-transitorycomputer-readable storage medium storing a computer program, thecomputer program including executable instructions that cause a computerto perform a method for using persistent party rooms, the methodincluding: initializing a global array according to a hierarchicalserver architecture; determining whether or not to create a newpersistent party room or to join a previously bookmarked persistentparty room; creating the new persistent party room within a positionindexed in the global array; and joining the previously bookmarkedpersistent party room by searching for the previously bookmarked partyroom utilizing the global array.

In yet another implementation, provided is a system of using persistentparty rooms, including: at least one computer system includingpersistent party room software; at least one server storing persistentparty room information to be interfaced with the persistent party roomsoftware; and a network connecting the at least one computer system andthe at least one server.

Other features and advantages of the present application will becomemore readily apparent to those of ordinary skill in the art afterreviewing the following detailed description and accompanying drawings.

BRIEF DESCRIPTION OF THE DRAWINGS

FIG. 1 illustrates a screen shot of an example persistent party room inaccordance with an implementation of the present application.

FIG. 2 illustrates a server architecture in accordance with animplementation of the present application.

FIG. 3 illustrates a flowchart showing a method for creating and joiningpersistent party rooms in accordance with an implementation of thepresent application.

FIG. 4 illustrates a flowchart showing an initialization method inaccordance with an implementation of the present application.

FIG. 5 illustrates a flowchart showing a method to create a newpersistent party room in accordance with an embodiment of the presentapplication.

FIG. 6 illustrates a flowchart showing a method that occurs for a firstroute when a bookmarked room is joined, in accordance with animplementation of the present application.

FIG. 7 illustrates a flowchart showing a method that occurs for a secondroute when a bookmarked room is joined, in accordance with animplementation of the present application.

FIG. 8 illustrates a flowchart showing a method that occurs for a thirdroute when a bookmarked room is joined, in accordance with animplementation of the present application.

FIG. 9A illustrates a representation of a computer system and a user inaccordance with an implementation of the present application.

FIG. 9B is a functional block diagram illustrating the computer systemhosting a logger in accordance with an implementation of the presentapplication.

DETAILED DESCRIPTION

Certain implementations as disclosed herein provide for persistent partyrooms. After reading this description it will become apparent how toimplement the present application in various alternative implementationsand alternative applications. However, although various implementationsof the present invention will be described herein, it is understood thatthese implementations are presented by way of example only, and notlimitation. As such, this detailed description of various alternativeimplementations should not be construed to limit the scope or breadth ofthe present application.

In one implementation, a persistent party room is a pseudo-permanentparty room that may appear to the user as a permanent party room but maybe destroyed and then created when any user returns to the party room,which can be bookmarked. The party room is used to keep friends oronline players together while they jump from game to game and stillengage in voice chat, text chat, video chat, etc., even if they areplaying different titles. With persistent party rooms, friends maybookmark or save a party room in order to easily join the same partyroom again at a later time.

A bookmarked persistent party room is a central place friends coordinateto go when they are in the mood to play games with one another. Forinstance, a bookmarked persistent party room could be named “FPS” forfriends of a user who like to play First Person Shooters, or a roomcalled “Racing” for friends who like to play racing games. A user canthen join any of the persistent party rooms depending on which game theuser wishes to play, the user's mood, or which persistent party room mayhave more or less people in it. The backend of software used toadminister persistent party rooms stores an associated unique ID of thepersistent party room. When a user wishes to join a persistent partyroom, the system searches to determine if a bookmark of the associatedunique ID exists. If a bookmark does not exist, a new associated uniqueID is created. This approach conserves resources by keeping thesepersistent party rooms always around. To the user, it appears as if thepersistent party rooms always exist, but in reality they are destroyedwhen everyone leaves the persistent party room (saved and bookmarked bya pointer representing the associated unique ID) and then created againwhen the first user joins the bookmarked persistent party room, wherethe associated unique ID of the persistent party room is looked up bythe system.

Currently, a party room implementation allows a user to create one partyroom which friends can then be invited to join or be allowed to join,usually via some search. When all the users have left the party room, itis destroyed. When a user then wishes to enter the party room, the partyroom is recreated by the user.

The persistent party room as disclosed by the present application solvesthis inefficiency problem by bookmarking or saving a persistent partyroom via an associated unique ID so that it can be quickly referenced orused at a later time. Users may be able to create different types ofpersistent party rooms centering around different types of activitieswith their friends. Additionally, if friends are having a good time in apersistent party room, they can choose to bookmark the persistent partyroom and coordinate their activity so that all or some of their friendsjoin them in the same persistent party room the next time they areavailable to play. The scheduling of games is further made convenient byusing a joined game acknowledgment feature in tandem with the persistentparty rooms, so slots in games are reserved beforehand.

In one implementation, provided is persistent party room software thatmay be stored and executed by a computer system to create persistentparty rooms where users can group together to play games, text chat,voice chat, video chat, etc. In one implementation, the computer systemmay be a next generation game console such as consoles from, forexample, Sony Playstation®.

FIG. 1 illustrates a screen shot of an example persistent party room100, according to an implementation of the present application.Persistent party room 100 includes current persistent party room toolbar102, persistent party room chat box 104, current member list 106,persistent party room list 108, user chat GUI window 110, user chatbuttons 112, and user information box 114. When a user launches thepersistent party room application, a screen that may appear similar topersistent party room 100 comes up.

Current persistent party room toolbar 102 displays which persistentparty room the user is currently in. The heart icon in 102 may be grayedout if the current persistent party room has not been bookmarked. If theuser touches the grayed heart icon, the heart icon will turn red, andthe current persistent party room will be bookmarked and the relevantbookmark data information (such as the associated unique ID of the room)may be saved to local storage. The bookmark information saved in localstorage may be compared against the bookmark information for party roomsthat are occupied by friends or other users.

Current member list 106 shows the users or friends who are currently inthe present persistent party room. If the room occupied by a usermatches a room that has previously been bookmarked, the heart icon in102 turns to red next to the name of the room. Furthermore, touching auser listed in current member 106 would bring up a profile of that userin a user information box. In one implementation, a user information boxwould hover near a cursor if the cursor was positioned over a user'sname. In another implementation, clicking a user's name would open upanother page showing a user information box, or open up a smaller windowshowing the user information box.

Persistent party room list 108 provides a list of bookmarked rooms sothat the user can decide to join them at anytime. The heart icons nextto the room names also indicate whether or not a room has beenbookmarked. If a bookmarked party room does not exist and the userwishes to create one, then the persistent party room will be created onthe server with an associated unique ID.

User chat GUI window 110 allows a user to type in text, videos, links,or other information, to communicate with other users. User chat buttons112 reflect various modes of communicating with other users (text,video, phone, etc.), and these modes of communication are not limited tothe buttons shown. User information box 114 compiles information aboutthe current user.

FIG. 2 illustrates a server architecture in accordance with animplementation of the present application. Specifically, FIG. 2illustrates server architecture 200 which shows at least one server 202,each of the servers 202 having at least one world 204, and each of theworlds 204 having at least one room 206.

In one implementation, the room 206 is where the persistent party roomis stored, and each persistent party room (of room 206) exists in oneworld 204, which exists on one server 202. In one implementation, eachserver 202 has multiple worlds 204 in it and each world 204 has multiplerooms 206 in it. Each persistent party room (e.g., room 206) may becreated on a particular server 202 and world 204. Each room 206, world204 and server 202 may have an associated unique ID (e.g., room ID,world ID, server ID). In one implementation, each room ID uses the worldID and the server ID in this unique ID. In another implementation, eachworld ID uses the server ID inside of its unique ID. In anotherimplementation, each of the IDs can track data about informationassociated with its other IDs (e.g., each server ID can locateinformation about its associated world ID and room ID, each world ID canlocate information about its associated server ID and room ID, and eachroom ID can locate information about its associated server ID and worldID).

FIG. 3 illustrates a flowchart showing a method 300 for creating andjoining persistent party rooms in accordance with an implementation ofthe present application. In one implementation, method 300 may start inbox 302, but may also start from anywhere else in FIG. 3 and the belowdescribed boxes may also be performed in any order. In box 304, aninitialization process (which is further explained below in conjunctionwith the description of FIG. 4) is performed.

In decision box 306, a decision is made of whether to join a bookmarkedpersistent party room or to create a new persistent party room. If theanswer to decision box 306 is to create a new persistent party room,then the next box is box 310, where a new persistent party room iscreated. If the answer to decision box 306 is to join a bookmarkedpersistent party room, then the next box is decision box 308, which maybranch out into at least one of three different scenarios: route A andthen box 312, route B and then box 314, or route C and then box 316.

Box 312, after route A, is the scenario where no bookmarked persistentparty rooms are found and where no duplicate persistent party rooms arefound, and is further explained below in conjunction with thedescription of FIG. 6. Box 314, after route B, is the scenario where nobookmarked persistent party rooms are found and where duplicatepersistent party rooms are found, and is further explained below inconjunction with the description of FIG. 7. Box 316, after route C, isthe scenario where bookmarked persistent party rooms are found, and isfurther explained below in conjunction with the description of FIG. 8.

After box 310 or boxes 312, 314 or 316, the next box is decision box318, which inquires as to whether or not the method 300 is doneprocessing (i.e., whether or not any more persistent party rooms shouldbe created or joined). If the answer to decision box 318 is no, then themethod 300 goes back to box 306. In one implementation, the above boxesmay be performed by a system implementing the persistent party roomsoftware or techniques discussed in the present application.

FIG. 4 illustrates a flowchart showing an initialization method of box304 (FIG. 3) in accordance with an implementation of the presentapplication. In one implementation, box 3040 may continue from the box302 in FIG. 3. In one implementation, the below-described method maystart in box 3040, but may also start from anywhere else in FIG. 4 andthe below described boxes may also be performed in any order. Box 3041gets a list of server IDs. In box 3042, a list of world IDs is receivedfrom each server ID. In box 3043, an array (entitled, for example,GlobalWorldIDListArray) is created that includes the world IDs acrossthe servers. For example, if there are two servers having four worldseach, the list for the world IDs across the servers would have eightitems total. In box 3044, the array is stored for later usage, forexample, when persistent party rooms are created (as further detailedbelow). In box 3045, the array may also be sorted by world ID for safetyin order to assure that the array would be uniform and substantiallysimilar (e.g., having the same order) across clients. Then everythingfinishes in box 3046, and in one implementation the next box from box3046 may be box 306 in FIG. 3.

In one implementation, the above-described process may get a list of allserver IDs, from each server ID get a list of all world IDs, create anarray containing all the world IDs across all the servers, and sort thearray for safety to assure it will be the same and in order across allclients.

FIG. 5 illustrates a flowchart showing a method to create a newpersistent party room of box 310 (FIG. 3) in accordance with anembodiment of the present application. In one implementation, box 3100may continue from box 306 in FIG. 3. In one implementation, thebelow-described method may start in box 3100, but may also start fromanywhere else in FIG. 5 and the below described boxes may also beperformed in any order. In box 3101, a bookmark UID (user ID) is createdby using a network platform ID and the current time. In oneimplementation the bookmark UID may be a data structure that containsthe network platform ID and a snapshot of the current time. The networkplatform ID is just the user name or login name for the current user whois logged into the network utilized by the persistent party roomsoftware.

In one implementation, the bookmark UID is approximately 64 bytes ofdata. The bookmark UID may also be used to decide which world ID (fromthe array, e.g., GlobalWorldIDListArray) to create a persistent partyroom in. In box 3102, the bookmark UID is used to decide in which worldID from the array to create a persistent party room by adding up thedata contained in the bookmark UID, for example, in 16 bit chunks andstoring it in another world list array (entitled, for example,WorldListChunk). In one implementation, the word list array may beanother 16 bit (or 2 byte) value, and all the bytes in the bookmark UIDstructure are summed up and saved as a 16 bit value named, for example,WorldListChunk. The overflow that may occur during summing up isarbitrary, and the goal is to obtain some randomness by using all thebytes in the bookmark UID structure. Then, in box 3103, a world ID isindexed or picked out of the GlobalWorldIDListArray by using, forexample, the following formula:

WorldListChunk %Count(GlobalWorldIDListArray)=GlobalWorldIDListArrayIndex,

where GlobalWorldIDListArrayIndex represents an index into theGlobalWorldIDListArray and also contains the world ID in which to createthe persistent party room, and where represents the modulo operator andalso where Count is the length of the GlobalWorldIDListArray. Therefore,the bookmark UID is used to index into the GlobalWorldIDListArray. Inbox 3104, GlobalWorldIDListArraylndex is used as an index into theGlobalWorldIDListArray, which will contain the world ID in which tocreate the persistent party room. Then, in box 3106 the processfinishes, and in one implementation the next box may be box 318 in FIG.3.

FIG. 6 illustrates a flowchart showing a method of box 312 (FIG. 3) thatoccurs for a first route when a bookmarked room is joined, in accordancewith an implementation of the present application. Box 312 follows routeA in FIG. 3. In one implementation, box 3120 may continue from decisionbox 308 in FIG. 3. In one implementation, the below-described method maystart in box 3120, but may also start from anywhere else in FIG. 6 andthe below described boxes may also be performed in any order. Box 3121gets the bookmark UID and the GlobalWorldIDListArrayIndex within theGlobalWorldIDListArray to determine on which world ID that thepersistent party room should exist. In box 3122, a search is performedon this world ID for the bookmark UID (which may be, in oneimplementation, a searchable attribute) to determine if any of thepersistent party rooms already exist with the world ID.

In decision box 3123, the branch question is asked whether any of theparty rooms with the bookmark UID already exist.

If the answer to decision box 3123 is no, then the next box is box 3124,where a new persistent party room is created. In box 3125, the newpersistent party room created in box 3124 is joined with the bookmarkUID, and then the method goes back to box 3122 to perform another searchto determine how many persistent party rooms exist with the currentbookmark UID. Then, boxes 3123 and 3126 may be repeated to finish in box3127. In one implementation, the answer to decision box 3123 on thefirst pass may be a no.

However, if the answer to decision box 3123 is yes, then the next box isbox 3126, which verifies if only one persistent party room exists (thecurrent persistent party room) with the same bookmark UID as above. Ifonly one persistent party room exists, then the method finishes in box3127, and in one implementation may go onto box 318 in FIG. 3. In oneimplementation, the answer to decision box 3123 may be yes on the firstpass which would imply more than one bookmarked room was found.

FIG. 7 illustrates a flowchart showing a method of box 314 (FIG. 3) thatoccurs for a second route when a bookmarked room is joined, inaccordance with an implementation of the present application. Box 314follows route B in FIG. 3. In one implementation, the box 3140 maycontinue from decision box 308 in FIG. 3. In one implementation, thebelow-described method may start in box 3140, but may also start fromanywhere else in FIG. 7 and the below described boxes may also beperformed in any order. Box 3141 gets the bookmark UID and theGlobalWorldIDListArrayIndex within the GlobalWorldIDListArray todetermine on which world ID that the persistent party room should exist.In box 3142, a search is performed on this world ID for the bookmark UID(which may be, in one implementation, a searchable attribute) todetermine if any of the persistent party rooms already exist with theworld ID.

In decision box 3143, the branch question is asked whether any of theparty rooms with the bookmark UID already exist.

If the answer to decision box 3146 is no, then box 3147 is executed,where the first persistent party room in the search results is joined,effectively destroying or replacing the current persistent party roomwith the joined persistent party room. Then, the method finishes in box3148 and may proceed onto box 318 in FIG. 3. In one implementation, theanswer to decision box 3146 on the first pass may be a no.

However, if the answer to decision box 3143 is yes, then the methodproceeds to decision box 3146. In decision box 3146 a determination ismade whether the current persistent party room is the first one thatcomes up in the search results when more than one persistent party roomexists with the same bookmark UID. If the answer to decision box 3146 isyes, then the method finishes in box 3148, which in one implementationmay go onto box 318 in FIG. 3. In one implementation, the answer todecision box 3123 may be yes on the first pass which would imply morethan one bookmarked room was found.

Going back to decision box 3143, if the answer to decision box 3143 isno, then the method proceeds to box 3144, where a new persistent partyroom is created. In box 3145, the new persistent party room created inbox 3144 is joined with the bookmark UID, and then the method goes backto box 3142 to perform another search to determine how many persistentparty rooms exist with the current bookmark UID. Then, boxes 3143, 3146and 3147 may be repeated to finish in box 3148.

FIG. 8 illustrates a flowchart showing a method of box 316 (FIG. 3) thatoccurs for a third route when a bookmarked room is joined, in accordancewith an implementation of the present application. Box 316 follows routeC shown in FIG. 3. In one implementation, box 3160 may continue fromdecision box 308 in FIG. 3. In one implementation, the below-describedmethod may start in box 3160, but may also start from anywhere else inFIG. 8 and the below described boxes may also be performed in any order.Box 3161 gets the bookmark UID and the GlobalWorldIDListArrayIndex intothe GlobalWorldIDListArray to determine on which world ID the persistentparty room should exist. In box 3162, a search is performed on thisworld ID for the bookmark UID (which may be, in one implementation, asearchable attribute) to determine if any of the persistent party roomsalready exist with the world ID. In box 3163, if one or more rooms arefound with the bookmark UID, then the first one returned in the searchresults is joined. In one implementation, it is assumed that the searchresults, which may be shown as room IDs—which specify which persistentparty room to join, will always return the same bookmark UID in the sameorder for box 3163. If this is not the case, the persistent party roomsin GlobalWorldIDListArray can be sorted by room ID, for example, whenGlobalWorldIDListArray is initialized, and the first room in the sortedsearch results may be used as a result. After box 3163, the methodfinishes in box 3164, which in one implementation may continue on to box318 in FIG. 3.

In one implementation, a joined game acknowledgment feature may beintegrated into the persistent party rooms. Essentially, a joined gameacknowledgment is a feature that may be supported by certain games. Thejoined game acknowledgment feature allows a player playing a game toreserve a slot for another player, without having to take the player'sattention off the current game being played. That is, the reservationand organization of the slots is done behind the scenes. For instance,player A is playing a game while player B is interested in joining thesame game player A is playing. Instead of waiting for an open slot tobecome available and waiting around with an open game screen or insteadof unnecessarily launching into the game only to found out that by thetime Player B's game was loaded, Player A's game is now full, player Bmay use the joined game acknowledgment feature to reserve a slot in thegame beforehand. Player B may also get a dialogue or dialogue boxstating that Player A's game is full before even attempting to launchPlayer A's game. The game has the joined game acknowledgment feature,and works behind the scenes without having to get player A involved toreserve a spot beforehand for player B. Player B is then sent anacknowledgment that a given spot is reserved.

In one implementation, the joined game acknowledgment feature supportsan NP basic system. In one implementation, NP Basic may be a system thatallows for the sending/receiving of game presence (online/offline statusof friends, for example), and also allows for the sending/receiving ofgame presence in a joinable game or a non-joinable game (e.g., singleplayer game). In a joinable game, the game presence may contain thedetails of the online game session that other friends can join into. Thejoined game acknowledgment feature may be used in tandem with persistentparty rooms and all types of party rooms (including non-persistent partyrooms) so that users waiting in a party room may instantly join activegames or reserve spots in active games and not have to wait around forslots to open. Using the joined game acknowledgment feature, users inparty rooms may also reserve game slots in each other's games as long asthey are in the same party. The join game acknowledgment feature furtherprovides a better user experience for the users in any party room sinceusers can immediately know if other games played by party members arefull or invalid (e.g., game sessions do not exist anymore). The loadtimes for games can reach several minutes sometimes, so this can beirritating to the user if they must wait for a game to launch beforethey find out that another party member's game is full or invalid. Thejoin game acknowledgment feature deftly avoids this problem by nothaving the user wait needlessly for something that may not materialize.

In one implementation, the application programming interface of thepersistent party rooms may support NP-Basic systems or NP-Basic programcalls. The application programming interface of the persistent partyrooms may also be implemented with flags (which may be stored for eachparty member) that are used to communicate the joined gameacknowledgment feature and also whether certain games support the joinedgame acknowledgment feature and/or whether party members are playing agame that supports the joined game acknowledgment feature. What also maybe supported is data describing whether party members in a persistentparty room or any other type of party room are playing a given game andwhat session of the game is currently being played.

FIG. 9A illustrates a representation of a computer system 900 and a user902 in accordance with an embodiment of the present disclosure. The user902 uses the computer system 900 to create, search or join persistentparty rooms. The computer system 900 stores and executes persistentparty room software 990.

FIG. 9B illustrates a functional block diagram illustrating the computersystem 900 hosting the persistent party room software 990 in accordancewith an embodiment of the present disclosure. The controller 910 is aprogrammable processor and controls the operation of the computer system900 and its components. The controller 910 loads instructions (e.g., inthe form of a computer program) from the memory 920 or an embeddedcontroller memory (not shown) and executes these instructions to controlthe system. In its execution, the controller 910 provides the persistentparty room software 990 with a software system, such as to enable thecreation, searching or joining of persistent party rooms. Alternatively,this service can be implemented as separate hardware components in thecontroller 910 or the computer system 900.

Memory 920 stores data temporarily for use by the other components ofthe computer system 900. In one implementation, memory 920 isimplemented as RAM. In one implementation, memory 920 also includeslong-term or permanent memory, such as flash memory and/or ROM.

Storage 930 stores data temporarily or long term for use by othercomponents of the computer system 900, such as for storing data used bythe persistent party room software 990. In one implementation, storage930 is a hard disk drive.

The media device 940 receives removable media and reads and/or writesdata to the inserted media. In one implementation, for example, themedia device 940 is an optical disc drive.

The user interface 950 includes components for accepting user input fromthe user of the computer system 900 and presenting information to theuser. In one implementation, the user interface 950 includes a keyboard,a mouse, audio speakers, and a display. The controller 910 uses inputfrom the user to adjust the operation of the computer system 900.

The I/O interface 960 includes one or more I/O ports to connect tocorresponding I/O devices, such as external storage or supplementaldevices (e.g., a printer or a PDA). In one implementation, the ports ofthe I/O interface 960 include ports such as: USB ports, PCMCIA ports,serial ports, and/or parallel ports. In another implementation, the I/Ointerface 960 includes a wireless interface for communication withexternal devices wirelessly.

The network interface 970 includes a wired and/or wireless networkconnection, such as an RJ-45 or “Wi-Fi” interface (including, but notlimited to 802.11) supporting an Ethernet connection.

The computer system 900 includes additional hardware and softwaretypical of computer systems (e.g., power, cooling, operating system),though these components are not specifically shown in FIG. 9B forsimplicity. In other implementations, different configurations of thecomputer system can be used (e.g., different bus or storageconfigurations or a multi-processor configuration). In oneimplementation, the computer system is a next generation game consolefrom, for example, Sony Playstation®.

In one implementation, huge bandwidth savings may be experienced byusing persistent party rooms. Because party rooms according to thecurrent party room implementations are killed and re-created persession, persistent party rooms conserve large amounts of bandwidthresources by using bookmark pointers that store information about a givepersistent party room. Furthermore, persistent party rooms avoid thebandwidth problems associated with star grid or mesh networks used whenplayers are waiting in a lobby to play a game.

The description herein of the disclosed implementations is provided toenable any person skilled in the art to make or use the presentapplication. Numerous modifications to these implementations would bereadily apparent to those skilled in the art, and the principals definedherein can be applied to other implementations without departing fromthe spirit or scope of the present application. For example, althoughthe specification describes persistent party rooms in the context ofonline games, these persistent party rooms can be used with any onlineor offline activity (offline in being based in an intranet, for exampleor local home network). In another example, the persistent party roomscan be used over computers or mobile devices, in addition to gameconsoles. Thus, the present application is not intended to be limited tothe implementations shown herein but is to be accorded the widest scopeconsistent with the principal and novel features disclosed herein.

Various implementations of the present application are realized inelectronic hardware, computer software, or combinations of thesetechnologies. Some implementations include one or more computer programsexecuted by one or more computing devices. In general, the computingdevice includes one or more processors, one or more data-storagecomponents (e.g., volatile or non-volatile memory modules and persistentoptical and magnetic storage devices, such as hard and floppy diskdrives, CD-ROM drives, and magnetic tape drives), one or more inputdevices (e.g., game controllers, mice and keyboards), and one or moreoutput devices (e.g., display devices).

The computer programs include executable code that is usually stored ina persistent storage medium and then copied into memory at run-time. Atleast one processor executes the code by retrieving program instructionsfrom memory in a prescribed order. When executing the program code, thecomputer receives data from the input and/or storage devices, performsoperations on the data, and then delivers the resulting data to theoutput and/or storage devices.

Those of skill in the art will appreciate that the various illustrativemodules and method steps described herein can be implemented aselectronic hardware, software, firmware or combinations of theforegoing. To clearly illustrate this interchangeability of hardware andsoftware, various illustrative modules and method steps have beendescribed herein generally in terms of their functionality. Whether suchfunctionality is implemented as hardware or software depends upon theparticular application and design constraints imposed on the overallsystem. Skilled persons can implement the described functionality invarying ways for each particular application, but such implementationdecisions should not be interpreted as causing a departure from thescope of the present application. In addition, the grouping of functionswithin a module or step is for ease of description. Specific functionscan be moved from one module or step to another without departing fromthe present application.

Additionally, the steps of a method or technique described in connectionwith the implementations disclosed herein can be embodied directly inhardware, in a software module executed by a processor, or in acombination of the two. A software module can reside in RAM memory,flash memory, ROM memory, EPROM memory, EEPROM memory, registers, harddisk, a removable disk, a CD-ROM, or any other form of storage mediumincluding a network storage medium. An example storage medium can becoupled to the processor such that the processor can read informationfrom, and write information to, the storage medium. In the alternative,the storage medium can be integral to the processor. The processor andthe storage medium can also reside in an ASIC.

All features of each above-discussed example are not necessarilyrequired in a particular implementation of the present application.Further, it is to be understood that the description and drawingspresented herein are representative of the subject matter which isbroadly contemplated by the present application. It is furtherunderstood that the scope of the present application fully encompassesother implementations that may become obvious to those skilled in theart and that the scope of the present application is accordingly limitedby nothing other than the appended claims.

1. A method for using persistent party rooms, comprising: initializing,via a computing device, a global array according to a hierarchicalserver architecture; determining, via the computing device, whether ornot to create a new persistent party room or to join a previouslybookmarked persistent party room; creating, via the computing device,the new persistent party room within a position indexed in the globalarray; and joining, via the computing device, the previously bookmarkedpersistent party room by searching for the previously bookmarked partyroom utilizing the global array.
 2. The method of claim 1, wherein thehierarchical server architecture comprises a structure of at least oneserver having associated server IDs, each of the at least one serverhaving at least one world having associated world IDs, and each of theat least one world having at least one room having associated room IDs.3. The method of claim 2, wherein the global array is an array includingthe world IDs across servers, and wherein the global array is sorted byworld ID to ensure uniformity across clients.
 4. The method of claim 1,wherein creating the new persistent party room comprises: calculating abookmark ID by using a network platform ID and the current time; addingup the data contained in the bookmark ID and storing the added up datain a new world-list-chunk value indexing a world ID out of the globalarray with a global array index and the new world-list-chunk value; andcreating the new persistent party room using the indexed world ID. 5.The method of claim 4, wherein joining the previously bookmarkedpersistent party room comprises: searching on the indexed world ID inthe global array for the bookmark ID to determine if there is anexisting persistent party room having the bookmark ID; creating a newpersistent party room having the bookmark ID and joining the newpersistent party room when no persistent party rooms having the bookmarkID exist; searching on the indexed world ID in the global array with thebookmark ID again to determine if there are any existing persistentparty rooms having the bookmark ID; and joining that one returnedpersistent party room when only one persistent party room is returned inthe search results having the bookmark ID.
 6. The method of claim 4,wherein joining the previously bookmarked persistent party roomcomprises: searching on the indexed world ID in the global array for thebookmark ID to determine if there is an existing persistent party roomhaving the bookmark ID; creating a new persistent party room having thebookmark ID and joining the new persistent party room when no persistentparty rooms having the bookmark ID exist; searching on the indexed worldID in the global array with the bookmark ID again to determine if thereare any existing persistent party rooms having the bookmark ID;verifying that the joined new persistent party room is the first one inthe search results, when more than one persistent party room with thesame bookmark ID exist; and joining the persistent party room that isthe first one in the search results, when the joined new persistentparty room is not the first one in the search results.
 7. The method ofclaim 4, wherein joining the previously bookmarked persistent party roomcomprises: searching on the indexed world ID in the global array for thebookmark ID to determine if there is an existing persistent party roomhaving the bookmark ID; joining the first persistent party room returnedin the search results when more than one persistent party rooms havingthe bookmark ID exist.
 8. The method of claim 4, wherein joining thepreviously bookmarked persistent party room comprises: sorting theglobal array by world ID; searching on the indexed world ID in theglobal array for the bookmark ID to determine if there is an existingpersistent party room having the bookmark ID; joining the firstpersistent party room returned in the search results, when more than onepersistent party rooms having the bookmark ID exist.
 9. The method ofclaim 1, further comprising: recognizing that a member playing an onlinegame and at least one other member belongs to a persistent party room,wherein the persistent party room being the new persistent party room orthe previously bookmarked persistent party room; reserving a spot forthe member in the online game for the at least one other member to joinin via a joined game acknowledgment feature; and allowing the at leastone other member to join the online game in their reserved spot.
 10. Anon-transitory computer-readable storage medium storing a computerprogram, the computer program comprising executable instructions thatcause a computer to perform a method for using persistent party rooms,the method comprising: initializing a global array according to ahierarchical server architecture; determining whether or not to create anew persistent party room or to join a previously bookmarked persistentparty room; creating the new persistent party room within a positionindexed in the global array; and joining the previously bookmarkedpersistent party room by searching for the previously bookmarked partyroom utilizing the global array.
 11. The storage medium of claim 10,wherein the hierarchical server architecture comprises a structure of atleast one server having associated server IDs, each of the at least oneserver having at least one world having associated world IDs, and eachof the at least one world having at least one room having associatedroom IDs.
 12. The storage medium of claim 10, wherein the global arrayis an array including the world IDs across servers, and wherein theglobal array is sorted by world ID to ensure uniformity across clients.13. The storage medium of claim 10, wherein creating the new persistentparty room comprises: calculating a bookmark ID by using a networkplatform ID and the current time; adding up the data contained in thebookmark ID in 16-bit chunks and storing the added up data in a newworld-list-chunk value; indexing a world ID out of the global array witha global array index and the new word-list-chunk value; and creating thenew persistent party room using the indexed world ID.
 14. The storagemedium of claim 13, wherein joining the previously bookmarked persistentparty room comprises: searching on the indexed world ID in the globalarray for the bookmark ID to determine if there is an existingpersistent party room having the bookmark ID; creating a new persistentparty room having the bookmark ID and joining the new persistent partyroom when no persistent party rooms having the bookmark ID exist;searching on the indexed world ID in the global array with the bookmarkID again to determine if there are any existing persistent party roomshaving the bookmark ID; and joining that one returned persistent partyroom when only one persistent party room is returned in the searchresults having the bookmark ID.
 15. The storage medium of claim 13,wherein joining the previously bookmarked persistent party roomcomprises: searching on the indexed world ID in the global array for thebookmark ID to determine if there is an existing persistent party roomhaving the bookmark ID; creating a new persistent party room having thebookmark ID and joining the new persistent party room when no persistentparty rooms having the bookmark ID exist; searching on the indexed worldID in the global array with the bookmark ID again to determine if thereare any existing persistent party rooms having the bookmark ID;verifying that the joined new persistent party room is the first one inthe search results, when more than one persistent party room with thesame bookmark ID exist; and joining the persistent party room that isthe first one in the search results, when the joined new persistentparty room is not the first one in the search results.
 16. The storagemedium of claim 13, wherein joining the previously bookmarked persistentparty room comprises: searching on the indexed world ID in the globalarray for the bookmark ID to determine if there is an existingpersistent party room having the bookmark ID; joining the firstpersistent party room returned in the search results when more than onepersistent party rooms having the bookmark ID exist.
 17. The storagemedium of claim 13, wherein joining the previously bookmarked persistentparty room comprises: sorting the global array by world ID; searching onthe indexed world ID in the global array for the bookmark ID todetermine if there is an existing persistent party room having thebookmark ID; joining the first persistent party room returned in thesearch results, when more than one persistent party rooms having thebookmark ID exist.
 18. The storage medium of claim 10, furthercomprising: recognizing that a member playing an online game and atleast one other member belongs to a persistent party room, thepersistent party room being the new persistent party room or thepreviously bookmarked persistent party room; having the member reserve aspot in the online game for the at least one other member to join in viaa joined game acknowledgment feature; and allowing the at least oneother member to join the online game in their reserved spot.
 19. Asystem of using persistent party rooms, comprising: at least onecomputer system comprising persistent party room software; at least oneserver storing persistent party room information to be interfaced withthe persistent party room software; and a network connecting the atleast one computer system and the at least one server.
 20. The system ofclaim 19, wherein the persistent party room software comprises:initialization means to initialize a global array according to ahierarchical server architecture within the persistent party roominformation stored by the at least one server; determination means todetermine whether or not to create a new persistent party room or tojoin a previously bookmarked persistent party room; creation means tocreate the new persistent party room within a world ID indexed in theglobal array; and joining means to join the previously bookmarkedpersistent party room by searching for the previously bookmarked partyroom utilizing the global array.